Quantum information processing with space-division multiplexing optical fibres

The optical fibre is an essential tool for our communication infrastructure since it is the main transmission channel for optical communications. The latest major advance in optical fibre technology is spatial division multiplexing (SDM), where new fibre designs and components establish multiple co-existing data channels based on light propagation over distinct transverse optical modes. Simultaneously, there have been many recent developments in the field of quantum information processing (QIP), with novel protocols and devices in areas such as computing, communication and metrology. Here, we review recent works implementing QIP protocols with SDM optical fibres, and discuss new possibilities for manipulating quantum systems based on this technology.Comment: Originally submitted version. Please see published version for improved layout, new tables and updated references following review proces

CIRCULAR METAPHORIZATION: The metaphor unveiling itself in the universe of the Torah

The Torah goes through the ages as the most important compendium of Hebrew literature. This work will investigate how the element metaphor appears preponderantly in the reading of the holy text. This element is embodied by the rabbinic parables (mashal), as metaphorical narratives which will attempt to unveil the metaphors inherent in this Book. In this literary context, it is by metaphor that one comes to a divine sense, from the Torah, which is metaphorical from its origin. The conception of this trope in Jewish perspective breaks with the model of metaphor conceived by the Classical Age: here it is a language founding element and can only be unveiled by itself, causing a circular metaphorization, where the literal meaning is not a cause, but an effect of this investigation

Alocação global de registradores de endereçamento para referencias a vetores em DSPs

Orientador: Guido Costa Souza de AraujoDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: O avanço tecnológico dos sistemas computacionais tem proporcionado o crescimento do mercado de sistemas dedicados, cada vez mais comuns no dia-a-dia das pessoas, como por exemplo em telefones celulares, palmtops e sistemas de controle automotivo. Devido às suas características, estas novas aplicações requerem sistemas que aliem baixo custo, alto desempenho e baixo consumo de potência. Uma das maneiras de atender a estes requisitos é utilizando processadores especializados. Contudo, a especialização na arquitetura dos processadores impõe novos desafios para o desenvolvimento de software para estes sistemas. Em especial, os compiladores - geralmente responsáveis pela otimização de código - precisam ser adaptados para produzir código eficiente para estes novos processadores. Na área de processamento de sinais digitais, como em telefonia celular, processadores especializados, denominados DSPs2, são amplamente utilizados. Estes processadores tipicamente possuem poucos registradores de propósito geral e modos de endereçamento bastante limitados. Além disso, muitas das suas aplicações envolvem o processamento de grandes seqüências de dados, as quais são geralmente armazenadas em vetores. Como resultado, o estudo de técnicas de otimização de referências a vetores tornou-se um problema central em compilação para DSPs. Este problema, denominado Global Array Reference Allocation (GARA), é o objeto central desta dissertação. O sub-problema central de GARA consiste em se determinar, para um dado conjunto de referências a vetores que serão alocadas a um mesmo registrador de endereçamento, o menor custo das instruções que são necessárias para manter este registrador com o endereço adequado em cada ponto do programa. Nesta dissertação, este sub-problema é modelado como um problema em grafos, e provado ser NP-difícil. Além disso, é proposto um algoritmo eficiente, baseado em programação dinâmica, para resolver este sub-problema de forma exata sob certas restrições. Com base neste algoritmo, duas técnicas são propostas para resolver o problema de GARA. Resultados experimentais, obtidos pela implementação destas técnicas no compilador GCC, comparam-nas com outros resultados da literatura. Os resultados demonstram a eficácia das técnicas propostas nesta dissertaçãoAbstract: The technological advances in computing systems have stimulated the growth of the embedded systems market, which is continuously becoming more ordinary in people's lives, for example in mobile phones, palmtops and automotive control systems. Because of their characteristics, these new applications demand the combination of low cost, high performance and low power consumption. One way to meet these constraints is through the design of specialized processors. However, processor specialization imposes new challenges to the development of software for these systems. In particular, compilers - generally responsible for code optimization - need to be adapted in order to produce efficient code for these new processors. In the digital signal processing arena, such as in cellular telephones, specialized processors, known as DSPs (Digital Signal Processors), are largely used. DSPs typically have few general purpose registers and very restricted addressing modes. In addition, many DSP applications include large data streams processing, which are usually stored in arrays. As a result, studing array reference optimization techniques became an important task in compiling for DSPs. This work studies this problem, known as Global Array Reference Allocation (GARA). The central GARA subproblem consists of determining, for a given set of array references to be allocated to the same address register, the minimum cost of the instructions required to keep this register with the correct address at alI program points. In this work, this subproblem is modeled as a graph theoretical problem and proved to be NP-hard. In addition, an efficient algorithm, based on dynamic programming, is proposed to optimally solve this subproblem under some restrictions. Based on this algorithm, two techniques to solve GARA are proposed. Experimental results, from the implementation of these techniques in the GCC compiler, compare them with previous work in the literature. The results show the effectiveness of the techniques proposed in this workMestradoMestre em Ciência da Computaçã

Primeros registros de nidos, crecimiento de polluelos y morfometría de Dendroplex picus peruvianus (Aves: Dendrocolaptidae) en el suroeste de la Amazonía brasileña

We reported the first data on the breeding and growth in Dendroplex picus peruvianus from a forest fragment in southwestern Amazonia. We observed and netted this species between 1999 and 2019. We found two active nests in 2012 and 2013, but we monitored only one. Clutch size was two eggs, incubated for 16 days. The constant growth rate (K) of nestlings was 0.31 with a growth asymptote of 46.3 g. We recorded a longest minimum longevity of eight years. Our records showed that D. p. peruvianus breeds mainly in the rainy season (September–March) overlapping with the molt period.Reportamos los primeros datos sobre la anidación y desarrollo de Dendroplex picus peruvianus en un fragmento de bosque en el suroeste de la Amazonia. Observamos y capturamos esta especie entre 1999 y 2019. Encontramos dos nidos activos en 2012 y 2013, pero monitoreamos solo uno. El tamaño de la camada fue de dos huevos incubados durante 16 días. La tasa de crecimiento constante (K) de los polluelos fue de 0.31 con una asíntota de crecimiento de 46.3 g. Registramos una longevidad mínima de ocho años. Nuestros datos mostraron que D. p. peruvianus se reproduce principalmente en la temporada de lluvias (septiembre–marzo) superponiéndose con el periodo de cambio de pluma

Biología reproductiva y biometría del Myiozetetes c. cayanensis (Aves: Tyrannidae) en el suroeste de la Amazonia brasileña y el período reproductivo en Brasil

Our study provides information on the breeding and biometrics of Rusty-Margined Flycatcher Myiozetetes cayanensis in southwest Brazilian Amazonia. Myiozetetes cayanensis is distributed from Central America until north of South America. We made observations on reproduction and captures of this species in a terra firme forest fragment in the state of Acre, between 1999 and 2020 and we evaluated the breeding season in Brazil through citizen science data. We monitored nine nests between 2012 and 2020, built at a mean height of 1.8 m above ground. Clutch size was two, three or four eggs, incubated for 15 days. We monitored the development of six nestlings: minimum hatch weight was 2 g and young fledged with a mean mass of ca. 25.5 g. The constant growth rate (K) of nestlings was 0.18 with a growth asymptote of 22.8 g. Daily survival rate was 90% and 100% during the incubation and nestling periods, respectively. The Mayfield success in the incubation and nestling periods was 20 and 100%, respectively. Apparent nesting success in the incubation and nestling periods was 46 and 100%, respectively. We recorded a minimum longevity of 2 years, nine months and 26 days. The subspecies M. c. cayanensis start to nest mainly between the dry and rainy season in Brazil, overlapping with the molt period in southwest Amazonia.Nuestro estudio proporciona información sobre la reproducción y la biometría del bienteveo alicastaño Myiozetetes cayanensis en el suroeste de la Amazonia brasileña. Myiozetetes cayanensis se distribuye desde América Central hasta el norte de América del Sur. Realizamos observaciones sobre la reproducción y captura de esta especie en un fragmento de bosque de tierra firme en el estado de Acre, entre 1999 y 2020 y evaluamos la época de reproducción en Brasil mediante datos de ciencia ciudadana. Monitoreamos nueve nidos entre 2012 y 2020, construidos a una altura promedio de 1.8 m sobre el suelo. El tamaño de la puesta fue de dos, tres o cuatro huevos, incubados durante 15 días. Monitoreamos el desarrollo de seis polluelos: el peso mínimo al nacer fue de 2 g y los polluelos con una masa media de ca. 25.5 g. La tasa de crecimiento constante (K) de los polluelos fue de 0.18 con una asíntota de crecimiento de 22.8 g. La tasa de supervivencia diaria fue del 90% y 100% durante los períodos de incubación y cría, respectivamente. El éxito de Mayfield en los períodos de incubación y cría fue de 20 y 100%, respectivamente. El éxito aparente de anidación en los períodos de incubación y polluelo fue de 46 y 100%, respectivamente. Registramos una longevidad mínima de 2 años, nueve meses y 26 días. La subespecie M. c. cayanensis comienzan a anidar principalmente entre la estación seca y lluviosa en Brasil, superponiéndose con el período de muda en el suroeste de la Amazonia

US Current Account Deficit and Exchange Rate Tax

We examine the relationship between the US current account deficit, the international value of the dollar, and the dollar reserves of foreign central banks. We find that the international value of the dollar impacts the US current account and also that dollar depreciations are accompanied by reductions in the inflow of foreign reserves. The inflow reductions are indicative that the US levies an exchange rate tax on foreigners because the foreign stock of reserves loses value.US current account; exchange rate tax

AN UPDATE ON THE BREEDING BIOLOGY AND BIOMETRY OF HAUXWELL’S THRUSH (TURDUS HAUXWELLI) FROM LOWLAND SOUTHWESTERN BRAZILIAN AMAZON

The Neotropical region is home to a large number of species of the genus Turdus. While the breeding biology of this genus is well known in general, data are scant for some Amazonian species, including Hauxwell’s Thrush (Turdus hauxwelli). Here, we present new data on the breeding and biometry of T. hauxwelli based on field observations and captures in a fragment of terra firme forest in southwestern Amazonia, Brazil. We monitored six active nests between 2012 and 2014, and collected data on the incubation and nestling phases on five nests. The nests were built at a mean height of 1.9 m (range: 0.53–3.2 m) above the ground. We estimated incubation time as 13–14 days. We monitored the development of 11 nestlings in four nests. The mean weight of the newly-hatched nestlings was 6.56 g (range: 4.3–9.0 g [SD = 2.27]). The constant (K) of the growth rate in the nestlings was 0.43 (range: 0.31–0.51; SE=0.03), with an asymptote of 51.1 g (range: 45.04 - 62.32; SE= 0.31). The daily survival rate of the nests during the incubation phase was 97%. However, the survival rate during the nestling phase was only 12%. Mayfield’s success was 70% during the incubation phase and 21% during the development of the nestlings, whereas apparent success was 75% in the incubation phase and 27% in the nestling phase. We banded and measured 64 adult individuals, 13 juveniles, and four nestlings in 2005 and between 2009 and 2017. Minimum longevity, calculated from the recapture of banded individuals, was 6 years, 3 months and 11 days (or 2298 days after banding). Our results indicate that T. hauxwelli has a breeding season restricted to a few months of the rainy season (November–March), which overlaps with molt

Parameterized Complexity of Equitable Coloring

A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times. Such a problem appears to be considerably harder than vertex coloring, being $\mathsf{NP\text{-}Complete}$ even for cographs and interval graphs. In this work, we prove that it is $\mathsf{W[1]\text{-}Hard}$ for block graphs and for disjoint union of split graphs when parameterized by the number of colors; and $\mathsf{W[1]\text{-}Hard}$ for $K_{1,4}$-free interval graphs when parameterized by treewidth, number of colors and maximum degree, generalizing a result by Fellows et al. (2014) through a much simpler reduction. Using a previous result due to Dominique de Werra (1985), we establish a dichotomy for the complexity of equitable coloring of chordal graphs based on the size of the largest induced star. Finally, we show that \textsc{equitable coloring} is $\mathsf{FPT}$ when parameterized by the treewidth of the complement graph

Fractional Integration and Its Influence on Unit Root and Co- Integration Analysis

Este estudo avalia o poder dos testes tradicionais de raízes unitárias e de co-integração, quando aplicados em processos estocásticos fracionariamente integrados no intervalo 0 ≤ d ≤ 1 . Foram conduzidas simulações de Monte Carlo para avaliar a sensibilidade dos testes de raízes unitárias em distinguir as condições I(1) − I(0) das condições fracionárias. Nossos resultados mostraram que os testes possuem individualmente baixo poder quando aplicados em séries pequenas com memória longa. No entanto, percebemos que sob determinadas condições os testes de raízes unitárias podem apresentar resultados que podem ajudar a evitar o problema da super-diferenciação na análise de estacionariedade das séries. Na análise de co-integração, considerando alternativas fracionárias no intervalo 0 ≤ d ≤ 0.6, encontramos condições que podem conduzir a resultados satisfatóriosThis study assesses the power of traditional unit root and co-integration tests when they are applied to fractionally integrated stochastic processes in the 0 ≤ d ≤ 1 range. Monte Carlo simulations were conducted to evaluate the sensitivity of the unit root tests in distinguishing the I(1)−I(0) conditions of the fractional conditions. Our results showed that unit root tests have individually low power when applied to small sample series with long-memory. However, we found that under specific conditions the unit root tests can produce results that can help avoid the over-differentiation problem. In the co-integration analysis for fractional alternatives on the interval 0 ≤ d ≤ 0.6, we found some conditions that can lead to satisfactory result